The nearest polynomial to multiple given polynomials with a given zero in the real case
نویسندگان
چکیده
منابع مشابه
Computing the nearest singular univariate polynomials with given root multiplicities
In this paper, we derive explicit expressions for the nearest singular polynomials with given root multiplicities and its distance to the given polynomial. These expressions can be computed recursively. These results extend previous results of (Zhi et al., 2004; Zhi and Wu, 1998).
متن کاملPolynomials with Integral Coefficients, Equivalent to a given Polynomial
Let f(x0, . . . , xn) be a homogeneous polynomial with rational coefficients. The aim of this paper is to find a polynomial with integral coefficients F (x0, . . . , xn) which is “equivalent” to f and as “simple” as possible. The principal ingredient of the proof is to connect this question with the geometric invariant theory of polynomials. Applications to binary forms, class numbers, quadrati...
متن کاملmesuring the staff technology readiness, the case of a multi national chemical company operating in iran
چکیده ندارد.
15 صفحه اولNearest multivariate system with given root multiplicities
We present a symbolic-numeric technique to find the closest multivariate polynomial system to a given one which has roots with prescribed multiplicity structure. Our method generalizes the “Weierstrass iteration”, defined by Ruatta, to the case when the input system is not exact, i.e. when it is near to a system with multiple roots, but itself might not have multiple roots. First, using interpo...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.03.033